| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 83LX3pFwXQZ4BFjAq/jhcvB |
| Repository | dpi.inpe.br/vagner/1999/11.26.17.09 |
| Last Update | 2000:01.03.02.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2001/03.30.15.57.59 |
| Metadata Last Update | 2022:06.14.00.17.06 (UTC) administrator |
| DOI | 10.1109/SIBGRA.1999.805735 |
| Citation Key | HashimotoBarr:1999:SiAlDe |
| Title | A simple algorithm for decomposing convex structuring elements  |
| Year | 1999 |
| Access Date | 2024, May 02 |
| Number of Files | 3 |
| Size | 282 KiB |
| 2. Context | |
| Author | 1 Hashimoto, Ronaldo Fumio 2 Barrera, Junior |
| Editor | Stolfi, Jorge Tozzi, Clésio Luis |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 12 (SIBGRAPI) |
| Conference Location | Campinas, SP, Brazil |
| Date | 17-20 Oct. 1999 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Pages | 275-282 |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Brazilian Computer Society and UNICAMP - University of Campinas |
| History (UTC) | 2008-07-17 14:17:59 :: administrator -> banon :: 2008-08-26 15:23:57 :: banon -> administrator :: 2009-08-13 20:36:20 :: administrator -> banon :: 2010-08-28 20:04:55 :: banon -> administrator :: 2022-06-14 00:17:06 :: administrator -> :: 1999 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | convex structuring element decomposition minkowski addition |
| Abstract | A finite subset of Z2 is called a structuring element. This paper presents a new and simple algorithm for decomposing a convex structuring element as sequence of Minkowski addition of a minimum number of subsets of the elementary square (i.e., the 3 x 3 square centered at the origin). Besides its simplicity, the advantage of this algorithm over some known algorithms is that it generates a sequence of non necessarily convex subsets, what means subsets with smaller cardinality and, consequently, faster implementation of the corresponding dilations and erosions. The algorithm is based on algebraic and geometrical properties of Minkowski additions. Theoretical analysis of correctness and computacional time complexity are also presented. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 1999 > A simple algorithm... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > A simple algorithm... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/83LX3pFwXQZ4BFjAq/jhcvB |
| zipped data URL | http://urlib.net/zip/83LX3pFwXQZ4BFjAq/jhcvB |
| Target File | 020-23414266.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46PDF8P 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/04.25.03.44 5 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Campinas, SP, Brazil, from October 17 to 20. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |